Phrase parsers from multi-axiom grammars

Phrase Parsers from Multi-Axiom Grammars

The multi-axiom grammars (MAG) are alternatives to the single-axiom context free grammars (CFG) and all-axiom algebraic grammars (AG) for programming language speci cation. Neither phrase recognition nor algebraic mechanisms for language processing are supported by CFGs. AGs support algebraic mechanisms for language processing but specify a smaller class of languages. MAGs avoid these limitatio...

Multitext Grammars and Synchronous Parsers

Partitioning Grammars and composing Parsers

GLR parsers have been criticized by various authors for their potentially large sizes. Other parsers also have individual weaknesses and strengths. Our heterogeneous parsing algorithm is based on GLR parsers that handle the size and other problems by partitioning the grammarduring compilingand assembling the partitioned sub-grammars during parsing. We discuss diierent parsers for diierent gramm...

Stacking of Dependency and Phrase Structure Parsers

We investigate the stacking of dependency and phrase structure parsers, i.e. we define features from the output of a phrase structure parser for a dependency parser and vice versa. Our features are based on the original form of the external parses and we also compare this approach to converting phrase structures to dependencies then applying standard stacking on the converted output. The propos...

Generating Eecient Substring Parsers for Brc Grammars

The concept of Bounded Context Parseable grammars is a less restricted variation of Bounded Context grammars a class of grammars that is especially suited for substring parsing. Robust parsing is introduced as a special form of parsing for BCP grammars. The di erences between robust parsing and LR(k) parsing are explored. A method of generating robust parsers is presented and complemented by pe...